The tensor product of commutative monoids
ثبت نشده
چکیده
We work throughout in the category Cmd of commutative monoids. In other words, all the monoids we meet are commutative, and consequently we say 'monoid' in place of the longer 'commutative monoid'. However, occasionally we will emphasize the commu-tativity. Almost every monoid A we meet will be written multiplicatively, that is we write xy for the compound of x, y ∈ A. In places we write something like x · y if this helps to avoid confusion. The unit (neutral element) is 1 or 1 A if the subscript helps to avoid confusion. One monoid that we use is written additively. This is the set N of natural number under addition. As we will see, this plays a special role in the constructions we describe. In the usual way for monoids B, C we write [B, C] for the set of morphism from B to C. Our first job is to turn this external set into an internal object of Cmd. To distinguish between the set and the monoid produce we introduce some notation. be the function given by (g · h)b = (gb)(hb) for b ∈ B. Let 1 B⇒C : B E C be the constant function given by 1 B⇒C b = 1 C for b ∈ B. It is routine to check that the constructed function g · h is a morphism, but this does depend on the commutativity of C. Thus for b 1 , b 2 ∈ B we have (h · g)(b 1 b 2) = (h(b 1 b 2))(g(b 1 b 2)) = (hb 1)(hb 2)(gb 1)(gb 2) = (hb 1)(gb 1)(hb 2)(gb 2) =((h · g)b 1)((h · g)b 2) where the third equality depends on the commutativity. A trivially exercise shows that the construction gives an associative and commutative operation on (B ⇒ C), and the function 1 B⇒C is the unit of this operation.
منابع مشابه
Fuzzy projective modules and tensor products in fuzzy module categories
Let $R$ be a commutative ring. We write $mbox{Hom}(mu_A, nu_B)$ for the set of all fuzzy $R$-morphisms from $mu_A$ to $nu_B$, where $mu_A$ and $nu_B$ are two fuzzy $R$-modules. We make$mbox{Hom}(mu_A, nu_B)$ into fuzzy $R$-module by redefining a function $alpha:mbox{Hom}(mu_A, nu_B)longrightarrow [0,1]$. We study the properties of the functor $mbox{Hom}(mu_A,-):FRmbox{-Mod}rightarrow FRmbox{-Mo...
متن کاملOn the Word Problem for Tensor Products and Amalgams of Monoids
We prove that the word problem for the free product with amalgamation S U T of monoids can be undecidable, even when S and T are nitely presented monoids with word problems that are decidable in linear time, the factorization problems for U in each of S and T , as well as other problems, are decidable in polynomial time, and U is a free nitely generated unitary submonoid of both S and T. This i...
متن کاملOn the character space of vector-valued Lipschitz algebras
We show that the character space of the vector-valued Lipschitz algebra $Lip^{alpha}(X, E)$ of order $alpha$ is homeomorphic to the cartesian product $Xtimes M_E$ in the product topology, where $X$ is a compact metric space and $E$ is a unital commutative Banach algebra. We also characterize the form of each character on $Lip^{alpha}(X, E)$. By appealing to the injective tensor product, we the...
متن کاملMatrix representations of trace monoids
We consider trace monoids i.e., free monoids where some pairs of letters are allowed to commute. We show that such monoids can be faithfully represented by 22-matrices with integer entries if and only if it they are direct products of a free commutative monoid with a free product of free commutative monoids.
متن کامل2 9 Ju n 20 06 Resolutions of free partially commutative monoids
In this paper we construct a free resolution for a free partially commutative monoid and with its help prove the Husainov’s Conjecture. We follow the ideas of D. Cohen who built in [3] a resolution for the so-called graph product of groups, given resolutions for factors. The presentation of the graph product with the help of direct and free amalgamated products played the leading role at that. ...
متن کاملCommutative Positive Varieties of Languages
We study the commutative positive varieties of languages closed under various operations: shuffle, renaming and product over one-letter alphabets. Most monoids considered in this paper are finite. In particular, we use the term variety of monoids for variety of finite monoids. Similarly, all languages considered in this paper are regular languages and hence their syntactic monoid is finite.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003